A Finite-State Parser for Use in Speech Recognition
نویسنده
چکیده
It is well known that phonemcs have different acoustic/phonetic realizations depending on the context. Fur example, the p h o n e m e / t / is typically realized with a different allophone (phonetic variant) in syllable initial position than in syllable final position. In syllable initial position (e.g., Tom),/ t / is almost always released (with a strong burst of energy) and aspirated (with h-like noise), whereas in syllable final position (e.g., cat.), / t / is often unreleased and unaspirated_ It is common practice in speech research to distinguish acoustic/phonetic properties that vary a great deal with context (e.g., release and aspiration) from those that are relatively invariant to context (e.g., place, manner and voicing). 2 In the past, the emphasis has been on invariants; allophonic variation is traditionally seen as problematic for recognition.
منابع مشابه
Comparative Study of GLR Parser with Finite-state Predictors and Chart-based Semantic Parsers
The natural language processing component of a speech understanding system is commonly a robust, semantic parser, implemented as either a chart-based transition network, or as a generalized left right (GLR) parser. In contrast, we are developing a robust, semantic parser that is a single, predictive finite-state machine. Our approach is motivated by our belief that such a finite-state parser ca...
متن کاملPROFER: predictive, robust finite-state parsing for spoken language
The natural languageprocessingcomponentof a speechunderstanding system is commonly a robust, semantic parser, implemented as either a chart-based transition network, or as a generalized leftright (GLR) parser. In contrast, we are developing a robust, semantic parser that is a single, predictive finite-state machine. Our approach is motivated by our belief that such a finite-state parser can ult...
متن کاملA Stochastic Finite-State Morphological Parser for Turkish
This paper presents the first stochastic finite-state morphological parser for Turkish. The non-probabilistic parser is a standard finite-state transducer implementation of two-level morphology formalism. A disambiguated text corpus of 200 million words is used to stochastize the morphotactics transducer, then it is composed with the morphophonemics transducer to get a stochastic morphological ...
متن کاملIncorporating Lr Parsing into Sphinx
This paper describes the integration of an LR natural language parser with the SPHINX speech recognition system. SPHINX is one of the most successful speech recognition systems in use today. Although it attains high word accuracy, SPHINX often outputs ungrammatical recognition results because the baseline SPHINX system uses very simple word-pair or bigram language models. For applications of sp...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملImproved Bayesian Training for Context-Dependent Modeling in Continuous Persian Speech Recognition
Context-dependent modeling is a widely used technique for better phone modeling in continuous speech recognition. While different types of context-dependent models have been used, triphones have been known as the most effective ones. In this paper, a Maximum a Posteriori (MAP) estimation approach has been used to estimate the parameters of the untied triphone model set used in data-driven clust...
متن کامل